An optimal algorithm for intersecting line segments in the plane
نویسندگان
چکیده
منابع مشابه
Robust Plane Sweep for Intersecting Segments
In this paper, we reexamine in the framework of robust computation the BentleyOttmann algorithm for reporting intersecting pairs of segments in the plane. This algorithm has been reported as being very sensitive to numerical errors. Indeed, a simple analysis reveals that it involves predicates of degree 5, presumably never evaluated exactly in most implementation. Within the exact-computation p...
متن کاملStabbers of line segments in the plane
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges for S, finding a stabbing wedge for a set of parallel segments with equal length, and computing other stabbers for S such as a double-wedge and a zigzag. The time and space ...
متن کاملOptimal Mesh Algorithms for the Voronoi Diagram of Line Segments and Motion Planning in the Plane
The motion planning problem for an object with two degrees of freedom moving in the plane can be stated as follows: Given a set of polygonal obstacles in the plane, and a two-dimensional mobile object B with two degrees of freedom, determine if it is possible to move B from a start position to a nal position while avoiding the obstacles. If so, plan a path for such a motion. Techniques from com...
متن کاملIntersecting Red and Blue Line Segments in Optimal Time and Precision
A common geometric problem in computer graphics and geographic information systems is to compute the arrangement of a set of n segments that can be colored red and blue so that there are no red/red or blue/blue crossings. We give a sweep algorithm that uses the minimum arithmetic precision and runs in optimal O(n logn + k) time and O(n) space to output an arrangement with k vertices, or O(n log...
متن کاملAn Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra
This paper describes a linear-time algorithm for computing the intersection of two convex polyhedra in 3-space. Applications of this result to computing intersections, convex hulls, and Voronoi diagrams are also given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the ACM
سال: 1992
ISSN: 0004-5411,1557-735X
DOI: 10.1145/147508.147511